منابع مشابه
Restricted 2-factor polytopes
The optimal k-restricted 2-factor problem consists of nding, in a complete undirected graph K n , a minimum cost 2-factor (subgraph having degree 2 at every node) with all components having more than k nodes. The problem is a relaxation of the well-known symmetric travelling salesman problem, and is equivalent to it when n 2 k n ? 1. We study the k-restricted 2-factor polytope. We present a lar...
متن کاملA TDI Description of Restricted 2-Matching Polytopes
We give a TDI description for a class of polytopes which corresponds to a restricted 2-matching problem. The perfect matching polytope, triangle-free perfect 2-matching polytope and relaxations of the traveling salesman polytope are members of this class. For a class of restrictions G. Cornuéjols, D. Hartvigsen and W.R. Pulleyblank have shown that the unweighted problem is tractable; here we sh...
متن کاملPolytopes associated with length restricted directed circuits
D = (V, A) mit Bo-gengewichten c a ∈ R, a ∈ A, einen gerichteten Kreis C einer zulässigen Länge |C| ∈ L mit minimalem Gewicht a∈C c a zu bestimmen. Dabei ist L die Menge der zulässigen Kreislängen. Das zugehörige Polytop ist das Polytop P L C (D) der längenbeschränkten gerichteten Kreise C in einem Digraphen D, das ist die konvexe Hülle der Inzidenzvek-toren der gerichteten Kreise C, die eine z...
متن کاملConvergent Lower Bounds for Packing Problems via Restricted Dual Polytopes
Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have been proposed for them. The most famous is from Gilmore and Gomory [5] and relies on a column generation scheme. Column generation methods are known to have convergence issues, and (when minimizing) no useful...
متن کاملRank 2 Affine Mv Polytopes
We give a realization of the crystal B(−∞) for ̂ sl2 using decorated polygons. The construction and proof are combinatorial, making use of Kashiwara and Saito’s characterization of B(−∞), in terms of the ∗ involution. The polygons we use have combinatorial properties suggesting they are the ̂ sl2 analogues of the Mirković-Vilonen polytopes defined by Anderson and the third author in finite type. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2000
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s101079900110